import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: wx
 * Date: 2023-07-28
 * Time: 7:05
 */
public class Test {

    //在同一个类中定义多个方法：要求不仅可以求2个整数的最大值，还可以求3个小数的最大值？

    public static int max(int x,int y) {
        return x > y ? x : y;
    }

    public  static int max(int x,int y,int z) {
         int ret =  x > y ? x : y;
         return ret > z ? ret : z;
    }

    public static void main6(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();
        int ret = max(a,b);
         ret = max(a,b,c);
        System.out.println("最大值->" + ret);


    }

    //在同一个类中,分别定义求两个整数的方法 和 三个小数之和的方法。 并执行代码，求出结果
    public static int sum(int a,int b) {
        return a + b;
    }

    public static double sum(double a,double b,double c) {
        return a + b + c;
    }

    public static void main5(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        double x = scanner.nextDouble();
        double y = scanner.nextDouble();
        double z = scanner.nextDouble();
        sum(a,b);
        sum(x,y,z);

    }

    //斐波那契数列


    public static int fib(int n) {
        int a = 1;
        int b = 1;
        int c = 1;
        if (n <= 2) {
            System.out.println(1);
        }
        while(n>=3) {
            c = a + b;
            a = b;
            b = c;
            n--;
        }
        return c;
    }

    public static void main4(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ret = fib(n);
        System.out.println(ret);
    }

    public  static int pow_sum(int n)  {
        int sum = 0;
        for (int i = 1; i < n ; i++) {
            int m = 1;
            for (int j = 1; j < i; j++) {
                m = m * j;
            }
             sum += m;
        }
        return sum;
    }
    public static void main3(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ret = pow(n);
        System.out.println(ret);
    }

    //求 N 的阶乘

    public static int pow(int x) {
        int j = 1;
        for (int i = 1; i < x ; i++) {
            j = j * i;
        }
        return j;
    }
    public static void main2(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ret = pow(n);
        System.out.println(ret);
    }

    //使用函数求最大值

    public static int max2(int x,int y) {
        return x > y ? x : y;
    }
    public static int max3(int x,int y,int z) {
        int ret = max2(x,y);
        return ret > z ? ret : z;
    }
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();
        int ret1 = max2(a,b);
        int ret2 = max3(a,b,c);
        System.out.println("两个数的最大值->" + ret1);
        System.out.println("三个数的最大值->" + ret2);

    }
}
